Far view two-dimensional symbology

ABSTRACT

To encode information into a two-dimensional (2D) symbol, a palette is selected to represent data in the 2D symbol, the palette including a set of shape fillers. A Base number system is selected according to the palette. A rule is selected, where the rule determines a manner of reading an encoded form of the data from the 2D symbol. The rule and the data are encoded as a set of shapes, where the shapes in the set of shapes are configured using the palette and arranged into a grid pattern, with or without visible grid lines, to form the 2D symbol. The 2D symbol is output in a size that matches an area.

TECHNICAL FIELD

The present invention relates generally to a method for codinginformation using two-dimensional (2D) symbols. More particularly, thepresent invention relates to a method for creating Far View (FV)two-dimensional symbology.

BACKGROUND

A barcode is an existing machine-readable representation of data usinglines or bars of varying thicknesses parallelly spaced relative oneanother in a specified area. This type of barcode is referred to as aone-dimensional barcode (1D-barcode), and are commonly seen printed onor associated with products, publications, displays, labels, anddocuments. Uniform Product Code (UPC) and UPC-A and UPC-E variantsthereof, EAN-8, EAN-13, ITF-14, Code128, Code39 are some examples of1D-barcodes used in the retail industry.

Several forms of two-dimensional barcodes, or two-dimensional codes (2Dcodes) are also presently available. Quick Response code (QR code) is awell-known example of 2D-codes (QR code is a registered trademark ofDenso Wave Incorporated, in the United States and in other countries).PDF417, DataMatrix, MaxiCode, GridMax, Aztec code, and ShotCode are someexamples of 2D-barcodes used in a variety of industries (any code namedherein, which is also a trademark, is owned by its respective owner).

A 1D-barcode carries a small amount of information, usually just enoughto represent ten or twenty alphanumeric characters as an example. A2D-code on the other hand can be configured to carry different amountsof data. Extreme cases of 2D-codes have been configured to carry evenseveral kilobytes of data.

SUMMARY

The illustrative embodiments provide a method for creating far viewtwo-dimensional symbology. An embodiment includes a method for encodinginformation into a two-dimensional (2D) symbol. The embodiment selects apalette to represent data in the 2D symbol, the palette comprising a setof shape fillers. The embodiment selects a Base number system accordingto the palette. The embodiment selects a rule, wherein the ruledetermines a manner of reading an encoded form of the data from the 2Dsymbol. The embodiment encodes the rule and the data as a set of shapes,wherein the shapes in the set of shapes are configured using the paletteand arranged into a grid pattern, with or without visible grid lines, toform the 2D symbol. The embodiment outputs the 2D symbol in a size thatmatches an area.

Another embodiment includes a computer usable program product comprisinga computer readable storage device including computer usable code forencoding information into a two-dimensional (2D) symbol.

Another embodiment includes a data processing system for encodinginformation into a two-dimensional (2D) symbol.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The novel features believed characteristic of the invention are setforth in the appended claims. The invention itself, however, as well asa preferred mode of use, further objectives and advantages thereof, willbest be understood by reference to the following detailed description ofthe illustrative embodiments when read in conjunction with theaccompanying drawings, wherein:

FIG. 1 depicts a block diagram of a network of data processing systemsin which illustrative embodiments may be implemented;

FIG. 2 depicts a block diagram of a data processing system in whichillustrative embodiments may be implemented;

FIG. 3A depicts a block diagram of an example FV code in accordance withan illustrative embodiment;

FIG. 3B depicts a block diagram of another example FV code in accordancewith an illustrative embodiment;

FIG. 4 depicts a block diagram of an example FV code comprising anexample rule section and an example data section in accordance with anillustrative embodiment;

FIG. 5 depicts a block diagram of an example FV code in accordance withan illustrative embodiment;

FIG. 6 depicts a block diagram of an example FV code in accordance withan illustrative embodiment;

FIG. 7 depicts a block diagram of an example FV code in accordance withan illustrative embodiment;

FIG. 8 depicts a block diagram of an example FV code in accordance withan illustrative embodiment; and

FIG. 9 depicts a flowchart of an example process for creating the farview two-dimensional symbology in accordance with an illustrativeembodiment.

DETAILED DESCRIPTION

The illustrative embodiments recognize that a need exists for codedinformation to be presented in large-formats, such as billboards,roof-tops, building elevations, game-fields, areas and structuresvisible from space, and other large areas in various planes. Presently,the only way to display or present existing 1D-barcodes and 2D-codes(collectively hereinafter, “existing codes” unless expresslydistinguished where used) is to enlarge an existing code to fill thegiven area.

The illustrative embodiments recognize that many existing codes areunsuitable for scaling or enlargement due to the proportionality ordimensional requirements of the specifications on which they are based.For example, a 1D-barcode, if stretched into a longer than specifiedlength of a rectangular area can cause a barcode reader to either notread the code or incorrectly read the code.

The illustrative embodiments also recognize that many existing codesthat can be scaled to fit an area are generally unsuitable forpresentation in large areas for other reasons. For example, a QR codecan be scaled up to fit a five thousand square feet area of a roof-top.However, a QR code is complex and may be difficult to paint on such alarge area with the required degree of accuracy so that a QR code readerwill be able to decode it when reading the large-format QR code, such asfrom a satellite in orbit. Therefore, the illustrative embodimentsrecognize that the complexity of the existing codes, the renderingprecision required for accurately reading an existing code inlarge-format, the reading angle required to read an existing code inlarge-format (both skew and tilt) and many other factors render existingcodes unsuitable for use in large-formats.

Not only is the large-format rendering of existing codes problematic,their complexity can often cause errors when reading them on a smallerscales as well. For example, a complex QR code or 2D barcode has minutegraphical patterns that must be printed accurately and presented on aneven surface for a reader to read the existing code accurately. Thisbecomes particularly problematic when the existing code has to beprinted or affixed on a surface that is not flat, or presents all orparts of the existing code at different angles to the reader, or whenall or parts of the existing code are obscured or distorted for anyreason.

Furthermore, existing codes are static representations of data. Anexisting code always represents the data in the form specified in thecode's specification. For example, a 1D-barcode is limited to a stringof characters. For example, suppose that the string is “ABC-123”. Thestring “ABC-123” will be encoded by a specific ordered set of barsaccording to Code128. That specific ordered set of bars is immutable for“ABC-123” under Code128, regardless of what ABC-123 represents.

Similarly, data “xyzcompany.com” encoded into a QR code alwayscorresponds to that representation under that QR code specification, andthat specification-compliant representation always means“xyzcompany.com”.

The illustrative embodiments recognize that such a static manner of datarepresentation using existing codes is too limiting. The illustrativeembodiments recognize that existing codes contain no rules to read thedata contained in the existing code.

In other words, an existing code itself cannot inform a reader, how toread or extract the data encoded therein. For example, presently,“1234567190” encoded in a specification-compliant existing code cannotbe read as “(123)456-7190”-a phone number, and “123.45.67.190”—aninternet protocol (IP) address, by specifying different extraction rulesin the existing code.

As an example, if the existing code were a QR code according to a QRcode specification, the QR code would have to specifically encode stringand data identifier “(123)456-7190” so that a reader extracts the digitsas a phone number; encoding the string “1234567190” will not cause sucha reading. And the QR code would have to specifically encode string“123.45.67.190” so that a reader extracts the digits as an IP address;encoding the string “1234567190” will not cause such a reading.

The illustrative embodiments used to describe the invention generallyaddress and solve the above-described problems and other problemsrelated to machine-readable representation of data. The illustrativeembodiments provide a method for creating far view two-dimensionalsymbology.

A far-view code (FV code) is a machine-readable representation of datain 2D according to an embodiment. An FV code uses simple geometricshapes that are easily scaled for large-format printing, painting,display, rendering, or presenting. The geometric shapes can be arrangedin any number of rows and columns, not necessarily in equal numbers ofrows and columns to form a square, and bound only by a defined boundary.

One or more markers associated with the FV code define the boundary ofthe resulting grid of shapes in the FV code. One or more markersassociated with the FV code are usable to orient a reader to read theshapes from the rows and columns of the grid in a prescribed sequence.One or more markers associated with the FV code are usable to calibratethe reader, to wit, provide the reader information about a dimension, anedge, a vertex, a size, a color or fill, or some combination thereof,used in a shape in the grid of the FV code.

A shape in the grid of the FV code can be colored or filled. In thesimplest form of an FV code according to an embodiment, the shapes canuse a color palette comprising black and white colors as fill colors orfills. In a more complex form of FV code according to anotherembodiment, the FV code uses a palette of any number of distinct colorsor fill-patterns. For example, one palette may comprise three colors,another palette may comprise sixteen colors, another palette maycomprise four fill patterns, another palette may comprise eight distinctshades of a color, and another palette may comprise some combination ofcolors, fill patterns, shades, to form n distinct fills for the shapesin a grid of an FV code.

The size of the palette determines the Base number system used to encodedata in the shapes. For example, when the palette uses two colors, e.g.,black and white, a shape can be colored black (or white) to representBinary 0, and the other color, e.g., white (or Black), representsBinary 1. Similarly, if the palette uses ten colors, shades, or fillpatterns, a shape of a first color, shade, or pattern represents Decimal1, a shape of a second color, shade, or pattern represents Decimal 2, ashape of a third color, shade, or pattern represents Decimal 3, a shapeof a fourth color, shade, or pattern represents Decimal 4, a shape of afifth color, shade, or pattern represents Decimal 5, a shape of a sixthcolor, shade, or pattern represents Decimal 6, a shape of a seventhcolor, shade, or pattern represents Decimal 7, a shape of an eighthcolor, shade, or pattern represents Decimal 8, a shape of a ninth color,shade, or pattern represents Decimal 9, and a shape of a tenth color,shade, or pattern represents Decimal 0.

Similarly, a palette of sixteen colors, shades, or patterns can be usedto encode the data using Hexadecimal number system into the FV code.Generally, depending upon the size of palette used, to wit, the numberof distinct colors, shades, or patterns used to fill the shapes in thegrid of an FV code, the FV code can be configured to encode the givendata using a corresponding Base number. In one embodiment, an absence ofcolor, an absence of fill, or an absence of a pattern is counted as acolor, fill, or pattern, respectively, towards the count of the colors,shades, or patterns in the palette.

An FV code further includes a rule section and a data section. A readingrule is encoded into the rule section, such that a manner of reading theencoded data section is configured according to the reading rule fromthe rule section. For example, suppose that the data encoded in the datasection of an example FV code is string “1234567190”. In one instance ofthe FV code, the rule section within the FV code dictates that the datais to be read in 3-3-4 pattern, which is a common phone number patternin the United States. Accordingly, the reader of the FV code reads,string “1234567190” as “123-456-7190”.

In another instance of the FV code, the rule section within the FV codedictates that the data is to be read in 3.2.2.3 pattern, which is an IPversion 4 (IPv4) address pattern. Accordingly, the reader of the FV codereads, string “1234567190” as “123.45.67.190”.

In one embodiment, the rule section is of a fixed length, i.e., a fixednumber of shapes in a known location in the grid of the FV code. Forexample, the first four shapes in the first row beginning from theleftmost column may encode the rule, and all shapes in the remainder ofthe first row, if any, and subsequent rows until the last column in thelast row encode the data.

Generally, the shapes in the grid are traversed from a designated firstshape to a designated last shape in some order. For example, the FV codegrid may be traversed left-to-right, top-to-bottom, making the leftmostshape in the topmost row the first shape, and making the rightmost shapein the bottom-most row the last shape to be read.

Generally, the rule section can occupy any number of shapes in anynumber of rows and columns, and the data can occupy the remaining numberof shapes in the given FV code. For example, in one embodiment, the ruleshapes occupy the first n columns in the first row; in anotherembodiment, the rule shapes occupy the first n shapes, which can wrapinto multiple rows of the grid; and in another embodiment, the ruleshapes occupy the first n columns of m rows.

In another embodiment, the rule section is demarcated in the grid. Forexample, in one embodiment, a delimiter character separates the rulesection from the data section in the grid. A reader reads the shapesfrom the first shape up to the shape(s) that encode the delimiter asencoding a reading rule. The reader reads the shapes after the shapesencoding the delimiter as encoding the data that is to be read accordingto the rule.

In another embodiment, a delimiter character marks the beginning of therule section, and the same or different delimiter character marks theend of the rule sections. This manner of embedding the rule into the FVcode allows the rule to be embedded anywhere within the data, in afloating manner. For example, in an example grid, shapes 1-55 may encodedata, shapes 56-59 encode a start delimiter, shapes 60-75 encode a rule,shapes 76-79 encode an end delimiter, and shapes 80-240 may encode moredata in the grid.

When a reader reads a rule in the FV code, the reader configures itselfto read the data section according to the rule. In one embodiment, thisconfiguring occurs with the help of an application associated with thereader, such as a device driver of the reader, an application embeddedin the reader hardware, or an application accessible to the reader overa data channel or network. For example, if the rule shapes encode Binary0101, such an application instructs the reader that the data will beread as an IPv4 address, and if the rule shapes encode Binary 0100, suchan application instructs the reader that the data will be read as aphone number in the form used in the United States. Generally, anynumber of shapes can encode a rule, therefore, any number of rules canbe encoded in various FV code. Correspondingly, a reference table in theapplication of the reader can include any number of (rule code, readinginstructions) pairs.

An FV code can even encode multiple rules and multiple correspondingdata sections using one or more techniques described herein. Forexample, in an example grid, shapes 1-4 may encode rule R1, shapes 5-44encode data D1 that is to be read according to rule R1; shapes 45-48 mayencode rule R2, shapes 49-88 encode data D2 that is to be read accordingto rule R2; and so on. A rule section can be associated with a datasection in other manners as well, such as by using section identifiers,different matching delimiters, and so on. These and other similarlypurposed manners of associating a rule section with a data section arecontemplated within the scope of the illustrative embodiments.

A method of an embodiment described herein, when implemented to executeon a device or data processing system, comprises substantial advancementof the functionality of that device or data processing system inencoding data in a machine readable manner. For example, the existingcodes of the prior-art are difficult and error-prone in large-formatreproductions, and encode the data such that the data has to be readexactly as encoded. The embodiments use simple geometric shapes anduse-specific palette to encode data. Such shapes and palettes areconducive to large-format reproduction because of the simplicity ofdrawing and filling repetitive geometric shapes on any scale.Furthermore, an FV code can encode the data in one form and allow areader to read the data in another form according to a rule that is alsoembedded within the FV code. Such manner of encoding data is unavailablein presently available devices or data processing systems. Thus, asubstantial advancement of such devices or data processing systems byexecuting a method of an embodiment improves the use of machine-readablerepresentations of data in large-format, and allows the machine readingto change by changing a rule while the data encoding remains unchanged.

The illustrative embodiments are described with respect to certainshapes, colors, shades, patterns, palettes, sizes, Base number systems,grid and grid size, section and section sizes, delimiters and delimitersizes, rules, reader and the application associated with the reader,devices, data processing systems, environments, components, andapplications only as examples. Any specific manifestations of these andother similar artifacts are not intended to be limiting to theinvention. Any suitable manifestation of these and other similarartifacts can be selected within the scope of the illustrativeembodiments.

Furthermore, the illustrative embodiments may be implemented withrespect to any type of data, data source, or access to a data sourceover a data network. Any type of data storage device may provide thedata to an embodiment of the invention, either locally at a dataprocessing system or over a data network, within the scope of theinvention. Where an embodiment is described using a mobile device, anytype of data storage device suitable for use with the mobile device mayprovide the data to such embodiment, either locally at the mobile deviceor over a data network, within the scope of the illustrativeembodiments.

The illustrative embodiments are described using specific code, designs,architectures, protocols, layouts, schematics, and tools only asexamples and are not limiting to the illustrative embodiments.Furthermore, the illustrative embodiments are described in someinstances using particular software, tools, and data processingenvironments only as an example for the clarity of the description. Theillustrative embodiments may be used in conjunction with othercomparable or similarly purposed structures, systems, applications, orarchitectures. For example, other comparable mobile devices, structures,systems, applications, or their architectures , may be used inconjunction with such embodiment of the invention within the scope ofthe invention. An illustrative embodiment may be implemented inhardware, software, or a combination thereof.

The examples in this disclosure are used only for the clarity of thedescription and are not limiting to the illustrative embodiments.Additional data, operations, actions, tasks, activities, andmanipulations will be conceivable from this disclosure and the same arecontemplated within the scope of the illustrative embodiments.

Any advantages listed herein are only examples and are not intended tobe limiting to the illustrative embodiments. Additional or differentadvantages may be realized by specific illustrative embodiments.Furthermore, a particular illustrative embodiment may have some, all, ornone of the advantages listed above.

With reference to the figures and in particular with reference to FIGS.1 and 2, these figures are example diagrams of data processingenvironments in which illustrative embodiments may be implemented. FIGS.1 and 2 are only examples and are not intended to assert or imply anylimitation with regard to the environments in which differentembodiments may be implemented. A particular implementation may makemany modifications to the depicted environments based on the followingdescription.

FIG. 1 depicts a block diagram of a network of data processing systemsin which illustrative embodiments may be implemented. Data processingenvironment 100 is a network of computers in which the illustrativeembodiments may be implemented. Data processing environment 100 includesnetwork 102. Network 102 is the medium used to provide communicationslinks between various devices and computers connected together withindata processing environment 100. Network 102 may include connections,such as wire, wireless communication links, or fiber optic cables.

Clients or servers are only example roles of certain data processingsystems connected to network 102 and are not intended to exclude otherconfigurations or roles for these data processing systems. Server 104and server 106 couple to network 102 along with storage unit 108.Software applications may execute on any computer in data processingenvironment 100. Clients 110, 112, and 114 are also coupled to network102. A data processing system, such as server 104 or 106, or client 110,112, or 114 may contain data and may have software applications orsoftware tools executing thereon.

Only as an example, and without implying any limitation to sucharchitecture, FIG. 1 depicts certain components that are usable in anexample implementation of an embodiment. For example, servers 104 and106, and clients 110, 112, 114, are depicted as servers and clients onlyas example and not to imply a limitation to a client-serverarchitecture. As another example, an embodiment can be distributedacross several data processing systems and a data network as shown,whereas another embodiment can be implemented on a single dataprocessing system within the scope of the illustrative embodiments. Dataprocessing systems 104, 106, 110, 112, and 114 also represent examplenodes in a cluster, partitions, and other configurations suitable forimplementing an embodiment.

Device 132 is an example of a device described herein. For example,device 132 can take the form of a smartphone, a tablet computer, alaptop computer, client 110 in a stationary or a portable form, awearable computing device, or any other suitable device. Any softwareapplication described as executing in another data processing system inFIG. 1 can be configured to execute in device 132 in a similar manner.Any data or information stored or produced in another data processingsystem in FIG. 1 can be configured to be stored or produced in device132 in a similar manner. Application 105 implements an embodimentdescribed herein. Application 105 generates code 142, which is anexample of an FV code according to an embodiment. Device 132 operates asa reader usable to read FV code 142. Application 134 is an applicationassociated with reader 132, and provides reading instructions to reader132 to read a data section in FV code 142 according to a rule sectionread from FV code 142.

Servers 104 and 106, storage unit 108, and clients 110, 112, and 114 maycouple to network 102 using wired connections, wireless communicationprotocols, or other suitable data connectivity. Clients 110, 112, and114 may be, for example, personal computers or network computers.

In the depicted example, server 104 may provide data, such as bootfiles, operating system images, and applications to clients 110, 112,and 114. Clients 110, 112, and 114 may be clients to server 104 in thisexample. Clients 110, 112, 114, or some combination thereof, may includetheir own data, boot files, operating system images, and applications.Data processing environment 100 may include additional servers, clients,and other devices that are not shown.

In the depicted example, data processing environment 100 may be theInternet. Network 102 may represent a collection of networks andgateways that use the Transmission Control Protocol/Internet Protocol(TCP/IP) and other protocols to communicate with one another. At theheart of the Internet is a backbone of data communication links betweenmajor nodes or host computers, including thousands of commercial,governmental, educational, and other computer systems that route dataand messages. Of course, data processing environment 100 also may beimplemented as a number of different types of networks, such as forexample, an intranet, a local area network (LAN), or a wide area network(WAN). FIG. 1 is intended as an example, and not as an architecturallimitation for the different illustrative embodiments.

Among other uses, data processing environment 100 may be used forimplementing a client-server environment in which the illustrativeembodiments may be implemented. A client-server environment enablessoftware applications and data to be distributed across a network suchthat an application functions by using the interactivity between aclient data processing system and a server data processing system. Dataprocessing environment 100 may also employ a service orientedarchitecture where interoperable software components distributed acrossa network may be packaged together as coherent business applications.

With reference to FIG. 2, this figure depicts a block diagram of a dataprocessing system in which illustrative embodiments may be implemented.Data processing system 200 is an example of a computer, such as servers104 and 106, or clients 110, 112, and 114 in FIG. 1, or another type ofdevice in which computer usable program code or instructionsimplementing the processes may be located for the illustrativeembodiments.

Data processing system 200 is also representative of a data processingsystem or a configuration therein, such as data processing system 132 inFIG. 1 in which computer usable program code or instructionsimplementing the processes of the illustrative embodiments may belocated. Data processing system 200 is described as a computer only asan example, without being limited thereto. Implementations in the formof other devices, such as device 132 in FIG. 1, may modify dataprocessing system 200, such as by adding a touch interface, and eveneliminate certain depicted components from data processing system 200without departing from the general description of the operations andfunctions of data processing system 200 described herein.

In the depicted example, data processing system 200 employs a hubarchitecture including North Bridge and memory controller hub (NB/MCH)202 and South Bridge and input/output (I/O) controller hub (SB/ICH) 204.Processing unit 206, main memory 208, and graphics processor 210 arecoupled to North Bridge and memory controller hub (NB/MCH) 202.Processing unit 206 may contain one or more processors and may beimplemented using one or more heterogeneous processor systems.Processing unit 206 may be a multi-core processor. Graphics processor210 may be coupled to NB/MCH 202 through an accelerated graphics port(AGP) in certain implementations.

In the depicted example, local area network (LAN) adapter 212 is coupledto South Bridge and I/O controller hub (SB/ICH) 204. Audio adapter 216,keyboard and mouse adapter 220, modem 222, read only memory (ROM) 224,universal serial bus (USB) and other ports 232, and PCl/PCIe devices 234are coupled to South Bridge and I/O controller hub 204 through bus 238.Hard disk drive (HDD) or solid-state drive (SSD) 226 and CD-ROM 230 arecoupled to South Bridge and I/O controller hub 204 through bus 240.PCl/PCIe devices 234 may include, for example, Ethernet adapters, add-incards, and PC cards for notebook computers. PCI uses a card buscontroller, while PCIe does not. ROM 224 may be, for example, a flashbinary input/output system (BIOS). Hard disk drive 226 and CD-ROM 230may use, for example, an integrated drive electronics (IDE), serialadvanced technology attachment (SATA) interface, or variants such asexternal-SATA (eSATA) and micro-SATA (mSATA). A super I/O (SIO) device236 may be coupled to South Bridge and I/O controller hub (SB/ICH) 204through bus 238.

Memories, such as main memory 208, ROM 224, or flash memory (not shown),are some examples of computer usable storage devices. Hard disk drive orsolid state drive 226, CD-ROM 230, and other similarly usable devicesare some examples of computer usable storage devices including acomputer usable storage medium.

An operating system runs on processing unit 206. The operating systemcoordinates and provides control of various components within dataprocessing system 200 in FIG. 2. The operating system may be acommercially available operating system such as AIX® (AIX is a trademarkof International Business Machines Corporation in the United States andother countries), Microsoft® Windows® (Microsoft and Windows aretrademarks of Microsoft Corporation in the United States and othercountries), Linux® (Linux is a trademark of Linus Torvalds in the UnitedStates and other countries), iOS™ (iOS is a trademark of Cisco Systems,Inc. licensed to Apple Inc. in the United States and in othercountries), or Android™ (Android is a trademark of Google Inc., in theUnited States and in other countries). An object oriented programmingsystem, such as the Java™ programming system, may run in conjunctionwith the operating system and provide calls to the operating system fromJava™ programs or applications executing on data processing system 200(Java and all Java-based trademarks and logos are trademarks orregistered trademarks of Oracle Corporation and/or its affiliates).

Instructions for the operating system, the object-oriented programmingsystem, and applications or programs, such as application 105 and readerapplication 134 in FIG. 1, are located on storage devices, such as harddisk drive 226, and may be loaded into at least one of one or morememories, such as main memory 208, for execution by processing unit 206.The processes of the illustrative embodiments may be performed byprocessing unit 206 using computer implemented instructions, which maybe located in a memory, such as, for example, main memory 208, read onlymemory 224, or in one or more peripheral devices.

The hardware in FIGS. 1-2 may vary depending on the implementation.Other internal hardware or peripheral devices, such as flash memory,equivalent non-volatile memory, or optical disk drives and the like, maybe used in addition to or in place of the hardware depicted in FIGS.1-2. In addition, the processes of the illustrative embodiments may beapplied to a multiprocessor data processing system.

In some illustrative examples, data processing system 200 may be apersonal digital assistant (PDA), which is generally configured withflash memory to provide non-volatile memory for storing operating systemfiles and/or user-generated data. A bus system may comprise one or morebuses, such as a system bus, an I/O bus, and a PCI bus. Of course, thebus system may be implemented using any type of communications fabric orarchitecture that provides for a transfer of data between differentcomponents or devices attached to the fabric or architecture.

A communications unit may include one or more devices used to transmitand receive data, such as a modem or a network adapter. A memory may be,for example, main memory 208 or a cache, such as the cache found inNorth Bridge and memory controller hub 202. A processing unit mayinclude one or more processors or CPUs.

The depicted examples in FIGS. 1-2 and above-described examples are notmeant to imply architectural limitations. For example, data processingsystem 200 also may be a tablet computer, laptop computer, or telephonedevice in addition to taking the form of a mobile or wearable device.

With reference to FIG. 3A, this figure depicts a block diagram of anexample FV code in accordance with an illustrative embodiment. FV Code302 is an example of code 142 in FIG. 1.

Code 302 uses a palette of two colors, e.g., black and white as shown inFIG. 3, in square shapes to represent Binary encoding. Markers 304, 306,and 308 are the same square shapes that are used to encode data in grid310. In the depicted simple example, markers 304, 306, and 308 operateto orient the reader, to wit, identify the first shape in grid 310. Whenscanning or reading FV code 302, the reader (not shown) identifiesmarker 304 as the top left corner, marker 306 as the top right corner,and marker 308 as the bottom left corner of FV code 302, therebylearning that shape 312 is the first shape in grid 310. Note that in FVcode 142, FV code 302, and other FV codes depicted in the variousfigures, a grid, such as grid 310, is depicted only for the clarity ofthe depiction and description and not as a needed part of an FV code.For example, the vertical and horizontal separator lines that separatethe various shapes, such as shape 312 within grid 310, are not expresslypainted or printed as lines in an actual FV code according to anembodiment. The outer rectangle of grid 310, which encloses the fourexample shapes such as shape 312, is also not expressly painted orprinted as a rectangle in an actual FV code according to an embodiment.An “as printed or presented” view of FV code 302 is depicted in FIG. 3A,and shows how FV code 302 would actually appear in print or paint.Unless an express border or separator line is specifically described asbeing a part of an FV code depicted in a figure herein, the FV codes inother figures are similarly printed or presented without those separatorlines or borders. In the depicted simple example, markers 304, 306, and308 also operate to identify the boundary of FV code 302 to the reader,to wit, identify the length and the height or width of FV code 302. Whenscanning or reading FV code 302, the reader (not shown) identifies thedistance from marker 304 to marker 306 as the length of FV code 302, andthe distance from marker 304 to marker 308 as the height or width of FVcode 302, thereby learning that dimensions of grid 310.

In the depicted simple example, one or more of markers 304, 306, and 308also operate to calibrate the reader, to wit, define for the reader thesize or dimensions of each shape in grid 310. When scanning or readingFV code 302, the reader (not shown) identifies any one of marker 304,marker 306, and marker 308, and measures the marker. For example, themeasurements provides the reader one or more sizes of the edges of theshape of the marker, a number of edges in the marker, a number ofvertices in the marker, one or more angles between the edges in themarker, or some combination thereof, to establish a geometric shape andsize of the marker. The shape and size of the marker calibrate thereader to read grid 310 as comprising of similar shapes of similarsizes.

This calibration is particularly useful if, for example, two shapesadjacent to each other are of the same color, thereby forming a largerdifferent shape of the color, which has to be divided into theconstituent two shapes. The reader, having been calibrated using marker304, 306, or 308, can divide the larger shape into the constituentshapes of the calibrated shape and size.

The reader, having been oriented and calibrated, and the grid havingbeen bounded in this example manner, FV code 302 is read. The readerbegins reading grid 310 starting at shape 312 and reading the blockssequentially till the end of the top row, then dropping to the next rowand reading from the leftmost shape in that next row till the end shapein that next row.

In the depicted example, suppose that Black shape represents Binary 1and White shape represents Binary 0. Accordingly, the reader reads“0110” from grid 310 in FV code 302.

With reference to FIG. 3B, this figure depicts a block diagram ofanother example FV code in accordance with an illustrative embodiment.FV Code 352 is another example of code 142 in FIG. 1. Markers 354, 356,and 358 operate in the manner of markers 304, 306, and 308,respectively, to orient and calibrate the reader and define the boundaryof grid 360. An “as printed or presented” view of FV code 352 isdepicted in FIG. 3B, and shows how FV code 352 would actually appear inprint or paint. Any border or separator line shown in this figure isonly illustrated for clarity of the description and is not a part of anyFV code depicted in this figure.

An FV code need not employ a square grid. Here, grid 360 is a rectangleand comprises n rows or m columns, as compared to a 2×2 square grid 310in FIG. 3A. Shape 362 operates in a manner similar to shape 312 in FIG.3A.

With reference to FIG. 4, this figure depicts a block diagram of anexample FV code comprising an example rule section and an example datasection in accordance with an illustrative embodiment. FV Code 402 is anexample of FV code 352 in FIG. 3B. Markers 404, 406, and 408 operate inthe manner of markers 354, 356, and 358, respectively. Grid 410 operatesin the example manner of grid 352 in FIG. 3B. Any border or separatorline shown in this figure is only illustrated for clarity of thedescription and is not a part of any FV code depicted in this figure.

Only as a non-limiting example, suppose that FV code 402 employs a fixedlength rule section. For example, rule section 412 occupies shapes 1, 2,3, and 4 as shown. Shapes 5-24 are occupied by data section 414. Inother words, a properly oriented and calibrated reader begins reading atshape 1 in grid 410 and regards the data as a rule to read data section414. The reader extracts the encoded data of shapes 1-4 according to theNumber system based on the palette used.

An application associated with the reader, such as application 134 inFIG. 1, includes reference table 420. Table 420 can take any suitableform without limitation to contain any number of the (rule code, readinginstructions) pairs.

Assuming, only as a simplified example, that the rules are expected tobe four Binary bits in length, the reader looks up the contents ofshapes 1-4 in column 422 of table 420, and obtains the correspondinginstructions from column 424.

Suppose, for example, shapes 1-4 were White, White, White, and Black,respectively, and the palette of FV code 302 was used in FV code 402.Accordingly, shapes 1-4 in rule section 412 were encoded as Binary 0001.Table 420 provides that when the rule section 412 provides rule value0001, data section 414 has to be read as an IPv4 address.

Here, 20 shapes from shape 5 through shape 24 encode an IPv4 address.For example, data section 414 may contain data 1038240, which is read asa subnet address of 103.82.40.000, where the “000” is implied accordingto a rule from the data of FV code 402.

With reference to FIG. 5, this figure depicts a block diagram of anexample FV code in accordance with an illustrative embodiment. FV Code502 is an example of FV code 302 in FIG. 3A, FV code 352 in FIG. 3B, orFV code 402 in FIG. 4.

An FV code according to an embodiment can be implemented using less thanthree marker shapes. For example, FV code 502 employs a single markershape—shape 504. Marker 504 is usable in the manner of marker 304 toorient a reader. For example, the reader orients FV code 502 such thatmarker 504 is at the top left corner of FV code 502.

Marker 504 is usable in the manner of marker 304 to calibrate a reader.For example, the reader determines a shape and size of marker 504, anduses that determined shape and size to identify and read the shapes ingrid 510.

Border 516 defines a boundary of grid 510 instead of markers 306 and 308as in FIG. 3A. In a non-limiting example, a solid line around the shapescontained within grid 510 indicates to the reader that the solid line isthe boundary of grid 510. Accordingly, the reader measures the lengthand height or width of boundary 516 to bound grid 510. Boundary 516forms a border that is a part of the FV code depicted in this figure.Any separator lines shown in this figure are only illustrated forclarity of the description and are not a part of any FV code depicted inthis figure.

The boundary can be defined in other ways. For example, in anothernon-limiting example, solid line 556 at the right edge of the grid thatis farthest from marker 554, and solid line 558 at the bottom edge ofthe grid that is farthest from marker 554, indicates to the reader theboundary of the grid. Particularly, the distance from the vertex ofmarker 554 that contacts grid 560, to line 556 is the length of grid560, and the distance from the vertex of marker 554 that contacts grid560, to line 558 is the height or width of grid 560. The dashed linesare not actually present in FV code 552 and are depicted only torepresent the boundary determined by the reader in this manner. Boundarylines 556 and 558 form a border that is a part of the FV code depictedin this figure. Any separator lines shown in this figure are onlyillustrated for clarity of the description and are not a part of any FVcode depicted in this figure.

Essentially, some combination of marker shapes such as shapes 304, 306,308, 504, and 554, and boundary lines such as lines 516, 556, and 558,or some combination thereof, can be used to correctly orient an FV codefor reading, calibrate a reader to recognize the shapes used in the FVcode, and define the boundary of the FV code. These exampleconfigurations in FIGS. 3A, 3B, 4, and 5 are not intended to belimiting. From this disclosure, those of ordinary skill in the art willbe able to conceive many other ways of adapting an FV code for properorientation, calibration, and bounding, and the same are contemplatedwithin the scope of the illustrative embodiments. With reference to FIG.6, this figure depicts a block diagram of an example FV code inaccordance with an illustrative embodiment. FV Code 602 is an example ofFV code 302 in FIG. 3A, FV code 352 in FIG. 3B, FV code 402 in FIG. 4,or FV code 502 in FIG. 5. Any border or separator line shown in thisfigure is only illustrated for clarity of the description and is not apart of any FV code depicted in this figure.

Marker shapes 604, 606, and 608 together can operate in the manner ofmarkers 304, 306, and 308 in FIG. 3A. Alternatively, marker 604 alonewith a boundary of grid 610, or marker 606 alone with a boundary of grid610, marker 608 alone with a boundary of grid 610, can also operate inthe manner of FV code 502 in FIG. 5, to orient, calibrate, and bound FVcode 602 for use with a reader.

An FV code according to an embodiment can be implemented using anysuitable shape, not just squares. For example, FV code 602 employsrectangular shapes. Whichever of markers 604, 606, and 608 are usedcalibrates a reader to read the shapes used for encoding in FV code 602.A reader then segments grid 610 according to that shape—a rectangle inthe present example—and reads the encoded rule, encoded data, or both.

With reference to FIG. 7, this figure depicts a block diagram of anexample FV code in accordance with an illustrative embodiment. FV Code702 is an example of FV code 602 in FIG. 6. Any border or separator lineshown in this figure is only illustrated for clarity of the descriptionand is not a part of any FV code depicted in this figure.

Marker shapes 704, 706, and 708 together can operate in the manner ofmarkers 304, 306, and 308 in FIG. 3A. Alternatively, marker 704 alonewith a boundary of grid 710, or marker 706 alone with a boundary of grid710, marker 708 alone with a boundary of grid 710, can also operate inthe manner of FV code 502 in FIG. 5, to orient, calibrate, and bound FVcode 702 for use with a reader.

An FV code according to an embodiment can be implemented using anysuitable shape, not just quadrilaterals. For example, FV code 702employs triangular shapes. Whichever of markers 704, 706, and 708 areused calibrates a reader to read the shapes used for encoding in FV code702. A reader then segments grid 710 according to that shape—a righttriangle in the present example—and reads the encoded rule, encodeddata, or both.

Note that some shapes can be oriented differently within grid 710. Forexample, shapes 1 and 2 are the same shape as marker 704, but shape 1 isoriented differently than marker 704 whereas shape 2 is oriented similarto marker 704. Other shapes 3, 4, 5, 6, 7, 8, and others are alsooriented in the manner of shapes 1 and 2, but can be oriented in otherways as may be geometrically possible.

For example, in an alternate form, FV code 702 may take the form of FVcode 702A and employ grid 710A. Any of markers 704, 706, and 708 can beoriented in any manner geometrically possible. For example, marker 704can be oriented in any of orientations 704A, 704B, 704C, or 704D in FVcode 702A. Similarly, marker 706 can be oriented in any of orientations706A, 706B, 706C, or 706D, based on the orientations of other markers inFV code 702A, or independent of the orientations of other markers in FVcode 702A. Similarly, marker 708, if used, can be oriented in any oforientations 708A, 708B, 708C, or 708D, based on the orientations ofother markers in FV code 702A, or independent of the orientations ofother markers in FV code 702A.

Note that the various alternative orientations for the markers aredepicted in FIG. 7 only for the clarity of the description. Theunselected alternatives are not printed or presented when FV code 702Ais presented. The various alternative orientations for the markers canalso apply to the orientations possible for the shapes within gird 710A.For example, shapes 1 and 2 in grid 710A may be oriented in the mannerof shapes 1 and 2 in grid 710 but shapes 9 and 10 may be orienteddifferently in grid 710A as depicted in this non-limiting example.

Just as different colors from a selected palette can be used tocommunicate information, to wit, a value in a corresponding Numbersystem, an orientation in combination with the palette can extend thepalette. For example, a palette of two colors, in combination with fourpossible orientations as in grid 710A, can result in an effectivepalette of 8 (2*4), for Base 8 representation of information in an FVcode.

With reference to FIG. 8, this figure depicts a block diagram of anexample FV code in accordance with an illustrative embodiment. FV Code802 is an example of FV code 602 in FIG. 6 or FV codes 702 or 702A inFIG. 7. Any border or separator line shown in this figure is onlyillustrated for clarity of the description and is not a part of any FVcode depicted in this figure.

The selection of a larger palette can enable the use of a higher orderBase Number system as described herein. As an example, FV code 802 isdepicted as using a palette of a six, having an example combination oftwo colors (black and white) and four patterns. The four patterns can befour other colors as described elsewhere but only depicted as patternsin the black and white patent drawing of FIG. 8. For example, shape 1 isof a first pattern or color, shape 2 is of a second pattern or color,shape 3 is of a third pattern or color, shape 4 is of a fourth patternor color, shape 5 is of the second pattern or color, shape 6 is also ofthe second pattern or color, shape 7 is of a fifth pattern or color, andshape 8 is of a sixth pattern or color in the example depiction of FIG.8. Other shapes use one of these patterns or colors from the selectedpalette. Within the scope of the illustrative embodiments, the markerscan be colored, shaded, or patterned uniformly using one selected color,shade, or pattern, (not shown)or using different colors, shades, orpatterns, from the selected palette as shown in the example depiction ofFIG. 8.

With reference to FIG. 9, this figure depicts a flowchart of an exampleprocess for creating the far view two-dimensional symbology inaccordance with an illustrative embodiment. Process 900 can beimplemented in application 105 in FIG. 1.

The application selects a palette for representing data in an FV code(block 902). The application selects a Base number system according tothe palette (block 904). The application selects a rule to represent amanner of reading the data from the FV code, e.g., a rule to represent atype of the encoded data, such as an IP address, a URL, or a phonenumber (block 906).

The application computes a size of the FV code grid according to thesize of the rule and the size of the data in the selected Base numbersystem (block 908). For example, the application may determine in block908 that the FV grid needs 600 shapes to represent the amount of dataplus sixteen shapes to represent the rule in the FV code, where the 616shapes (assuming no delimiter) will be coded in Base 16 using a paletteor effective palette of 16 colors, shapes, patterns, shape orientations,or some combination thereof.

The application determines a use-specific configuration or layout of theFV code grid (block 910). For example, the application determines anumber of rows and number of columns in the grid such that the overallshape of the grid will fit a given shape of an elongated rectangularroof-top or road-side.

In one embodiment, the use-specific configuration of the grid may be adefault configuration of the grid. In another embodiment, theapplication further determines the configuration of the grid bydetermining the geometry of the shapes to be used in the grid, themarkers to be used, any borders to be used, or some combination thereof.As a non-limiting example, if the application determines that the FVcode will use three markers, the application may select a longer row ascompared to when a single marker in conjunction with a border willidentify the boundary of the FV code grid.

The application generates the FV code using the set of shapes accordingto the selected palette, arranging the set of shapes in the determinednumbers of rows and columns, using the determined markers and optionalborders (block 912). The application outputs the FV code, e.g., forprinting or painting on a large-format area (block 914). The applicationends process 900 thereafter. Process 900 is usable to produce FV codesfor small-formal printing as well, such as for labels affixed on boxesor uneven surfaces or irregular shaped areas.

Thus, a computer implemented method is provided in the illustrativeembodiments for creating the far view two-dimensional symbology. Wherean embodiment or a portion thereof is described with respect to a typeof device, the computer implemented method or a portion thereof, areadapted or configured for use with a suitable and comparablemanifestation of that type of device.

An FV code is easier and more accurate to present on a large-formatarea, as compared to an existing code, because of the modular design ofthe FV code. A printing or painting process for an example FV code maybe as simple as laying out a grid pattern and filling in the blacksquares. A square master plate could be repeatedly applied to form thegrid, or several easily cut square patterns could be laid out in thegrid to print or paint the example FV code. Because of the simple designof the FV code, reading or photographing the FV code is easier and moreaccurate, even at oblique angles as compared to an existing code,especially from far distances of thousands of yards (meters), even fromspace. The print/paint quality control of an FV code is easier thancontrolling the large-format print quality of existing 2D symbols,thereby reducing the cost and lead time to print or paint the encodedinformation. The rules of reading the encoded data embedded in the FVcodes allow the flexibility in encoding the data for variety of purposeswithout having to create new encoded forms of the data for differentapplications.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

1. A method for encoding information into a two-dimensional (2D) symbol,the method comprising: selecting, using a processing unit and a memory,a palette to represent data in the 2D symbol, the palette comprising aset of shape fillers; computing, using the processing unit and thememory, a size of the palette; computing, using the processing unit andthe memory, a Base number system as a function of the size of thepalette; selecting, using the processing unit and the memory, a rule,wherein the rule specifies a reading pattern for reading an encoded formof the data from the 2D symbol, wherein the reading pattern is relatedto one meaning from a plurality of meanings of the data; encoding, usingthe processing unit and the memory, the rule and the data as a set ofshapes, wherein the shapes in the set of shapes are configured using thepalette and arranged into a grid to form the 2D symbol; and outputting,using the processing unit and the memory, the 2D symbol in a size thatmatches an area.
 2. The method of claim 1, further comprising: selectinga geometrical shape to represent the data in the 2D symbol, wherein eachshape in the set of shapes is of the geometric shape; and selecting anumber of shapes in the set of shapes, wherein the number of shapes isat least a smallest number of shapes which when configured according tothe palette represents the data and the rule in the selected Base numbersystem.
 3. The method of claim 1, further comprising: computing a numberof rows in the grid; computing a number of columns in the grid; andarranging the set of shapes in the computed number of rows and thecomputed number of columns.
 4. The method of claim 3, furthercomprising: determining a layout of a large format area, wherein thearea is a printable portion of the large format area, and wherein thelayout comprises a length of the area and a width of the area; anddetermining, as a part of the computing the number of columns, a numberof shapes that fit in the length of the area.
 5. The method of claim 1,further comprising: configuring, as a part of the 2D symbol, outside thegrid, a set of marker shapes, wherein all data is encoded using the setof shapes within the grid, wherein a marker shape in the set of markershapes and a shape in the set of shapes have identical geometricparameters.
 6. The method of claim 5, wherein the set of marker shapesincludes a first marker shape, a second marker shape, and a third markershape, further comprising: computing a length of the grid as a distancebetween the first marker shape and the second marker shape; computing anumber of columns in the grid using the length of the grid; computing aheight of the grid as a distance between the first marker shape and thethird marker shape; computing a number of rows in the grid using theheight of the grid; and computing a number of shapes in the grid usingthe geometric parameters of the single marker shape.
 7. The method ofclaim 5, wherein the set of marker shapes includes a single markershape, further comprising: configuring, as another part of the 2Dsymbol, a first border edge of the grid and a second border edge of thegrid; computing a length of the grid as a distance between the singlemarker shape and the first border edge; computing a number of columns inthe grid using the length of the grid; computing a height of the grid asa distance between the single marker shape and the second border edge;computing a number of rows in the grid using the height of the grid; andcomputing a number of shapes in the grid using the geometric parametersof the single marker shape.
 8. The method of claim 1, wherein each shapein the set of shapes is a rectangular geometry wherein a length in therectangular geometry is different from a height in the rectangulargeometry.
 9. The method of claim 1, wherein each shape in the set ofshapes comprises a triangular geometry.
 10. The method of claim 1,further comprising: determining a number of members in the set of shapefillers in the palette; and selecting, as a Base number of the Basenumber system, the number of members in the set of shape fillers in thepalette.
 11. The method of claim 1, wherein a first shape filler in theset of shape fillers comprises a first orientation, in the grid, of ashape in the set of shapes.
 12. The method of claim 1, wherein a firstshape filler in the set of shape fillers comprises a first color and asecond shape filler in the set of shape fillers comprises a secondcolor.
 13. The method of claim 1, wherein a first shape filler in theset of shape fillers comprises a first shade of a color and a secondshape filler in the set of shape fillers comprises a second shade of acolor.
 14. The method of claim 1, wherein a first shape filler in theset of shape fillers comprises a first fill-pattern and a second shapefiller in the set of shape fillers comprises a second fill-pattern. 15.The method of claim 1, further comprising: selecting a delimiter,wherein the delimiter demarcates an encoded form of the rule from theencoded form of the data in the 2D symbol; and encoding the delimiter inthe 2D symbol using a shape from the set of shapes.
 16. The method ofclaim 15, further comprising: locating, by the presence of an encodedform of the delimiter at a position in the grid, the encoded form of therule, wherein the position of the delimiter causes the encoded form ofthe rule to be unrestrictedly situated in the grid of the 2D symbol.